The number field sieve for integers of low weight
نویسندگان
چکیده
منابع مشابه
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as ∑w i=1 i2 ci , with 1, . . . , w ∈ {1,−1}. Since arithmetic modulo a prime of low weight is particularly efficient, it is tempting to use such primes in cryptographic protocols. In this paper we consider the difficulty of the discrete logarithm problem modulo a prime N of low weight, as well as the diffi...
متن کاملThe number field sieve
We describe the main ideas underlying integer factorization using the number field sieve.
متن کاملThe Number Field Sieve
One of the most important and widely-studied questions in computational number theory is how to efficiently compute the prime factorizations of large integers. Among other applications, fast prime-factorization algorithms would break the widely-used RSA cryptosystem, and be of great interest in complexity theory. In particular, there is no algorithm which can factor an integer n in polynomial t...
متن کاملThe Tower Number Field Sieve
The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields Fpn where n is a small integer larger than 1. The state-of-art algorithm is the number field sieve (NFS) together with its many variants. When p has a special form (SNFS), as in many pairings constructions, NFS has a faster variant due to Joux and Pierrot. We present a new NFS v...
متن کاملA Description of the Number Field Sieve
The number field sieve is a relatively new method to factor large integers. Its most notable success is the factorization of the ninth Fermat number. It is significantly faster than all known existing integer factoring algorithms. We examine the theoretical underpinnings of the sieve; after understanding how it works, we state the algorithm. We look mostly to the algebraic number theory aspects...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2010
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-09-02198-x